Optimal Gram-schmidt Type Algorithms
نویسنده
چکیده
A Gram-Schmidt type algorithm is given for finite d-dimensional reflexive forms over division rings. The algorithm uses d/3 + O(d) ring operations. Next, that algorithm is adapted in two new directions. First a sequential algorithm is given whose complexity matches the complexity of matrix multiplication. Second, a parallel NC algorithm is given with similar complexity.
منابع مشابه
ON THE CONTINUITY OF PROJECTIONS AND A GENERALIZED GRAM-SCHMIDT PROCESS
Let ? be an open connected subset of the complex plane C and let T be a bounded linear operator on a Hilbert space H. For ? in ? let e the orthogonal projection onto the null-space of T-?I . We discuss the necessary and sufficient conditions for the map ?? to b e continuous on ?. A generalized Gram- Schmidt process is also given.
متن کاملGram–Schmidt Process in Different Parallel Platforms
Important operations in numerical computing are vector orthogonalization. One of the well-known algorithms for vector orthogonalisation is Gram–Schmidt algorithm. This is a method for constructing a set of orthogonal vectors in an inner product space, most commonly the Euclidean space Rn. This process takes a finite, linearly independent set S = {b1, b2, ..., bk} vectors for k ≤ n and generates...
متن کاملStability Analysis and Improvement of the Block Gram-Schmidt Algorithm
The advent of supercomputers with hierarchical memory systems has imposed the use of block algorithms for the linear algebra algorithms. Although block algorithms may result in impressive improvements in performance, their numerical properties are quite different from their scalar counterpart and deserve an in-depth study. In this paper, the numerical stability ofblock Gram-Schmidt orthogonaliz...
متن کاملTranslation and modern interpretation of Laplace’s Théorie Analytique des Probabilités, pages 505-512, 516-520
The text of Laplace, Sur l’application du calcul des probabilités à la philosophie naturelle, (Théorie Analytique des Probabilités. Troisième Édition. Premier Supplément), 1820, is quoted in the context of the Gram-Schmidt algorithm. We provide an English translation of Laplace’s manuscript (originally in French) and interpret the algorithms of Laplace in a contemporary context. The two algorit...
متن کاملPerformance Evaluation of Some Inverse Iteration Algorithms on PowerXCell 8i Processor
In this paper, we compare with the inverse iteration algorithms on PowerXCell 8i processor, which has been known as a heterogeneous environment. When some of all the eigenvalues are close together or there are clusters of eigenvalues, reorthogonalization must be adopted to all the eigenvectors associated with such eigenvalues. Reorthogonalization algorithms need a lot of computational cost. The...
متن کامل